From algebraic sets to monomial linear bases by means of combinatorial algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From algebraic sets to monomial linear bases by means of combinatorial algorithms

Let K be a eld; let P K n be a nite set and let =(P) Kx 1 ; : : :; x n ] be the ideal of P. A purely combinatorial algorithm to obtain a linear basis of the quotient algebra Kx 1 ; : : :; x n ]==(P) is given. Such a basis is represented by an n-dimensional Ferrers diagram of monomials which is minimal with respect to the inverse lexicographical order i:l:. It is also shown how this algorithm ca...

متن کامل

Algebraic Algorithms in Combinatorial Optimization

In this thesis we extend the recent algebraic approach to design fast algorithms for two problems in combinatorial optimization. First we study the linear matroid parity problem, a common generalization of graph matching and linear matroid intersection, that has applications in various areas. We show that Harvey’s algorithm for linear matroid intersection can be easily generalized to linear mat...

متن کامل

Monomial Relization of Crystal Bases for Special Linear Lie Algebras

We give a new realization of crystal bases for finite dimensional irreducible modules over special linear Lie algebras using the monomials introduced by H. Nakajima. We also discuss the connection between this monomial realization and the tableau realization given by Kashiwara and Nakashima. Introduction The quantum groups, which are certain deformations of the universal enveloping algebras of ...

متن کامل

Monomial bases related to the n! conjecture

Let μ = (μ1 ≥ μ2 ≥ · · · ≥ μk > 0) be a partition of n. We shall identify μ with its Ferrers diagram (using the French notation). To each cell s of the Ferrers diagram, we associate its coordinates (i, j), where i is the height of s and j the position of s in its row. The pairs (i − 1, j − 1) occurring while s describes μ will be briefly referred to as the set of the biexponents of μ. Now let (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1995

ISSN: 0012-365X

DOI: 10.1016/0012-365x(94)00126-4